Approximate dynamic programming with a fuzzy parameterization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate dynamic programming with a fuzzy parameterization

Dynamic programming (DP) is a powerful paradigm for general, nonlinear optimal control. Computing exact DP solutions is in general only possible when the process states and the control actions take values in a small discrete set. In practice, it is necessary to approximate the solutions. Therefore, we propose an algorithm for approximate DP that relies on a fuzzy partition of the state space, a...

متن کامل

Adaptive Critic Based Approximate Dynamic Programming for Tuning Fuzzy Controllers

This work was supported by the National Science Foundation under grant ECS-9904378. Abstract: In this paper we show the applicability of the Dual Heuristic Programming (DHP) method of Approximate Dynamic Programming to parameter tuning of a fuzzy control system. DHP and related techniques have been developed in the neurocontrol context but can be equally productive when used with fuzzy controll...

متن کامل

Approximate dynamic programming with affine ADDs

context-specific additive multiplicative ! " # # ! # ! " # $ # #% "& #% "&

متن کامل

Approximate Dynamic Programming via Linear Programming

The curse of dimensionality gives rise to prohibitive computational requirements that render infeasible the exact solution of largescale stochastic control problems. We study an efficient method based on linear programming for approximating solutions to such problems. The approach "fits" a linear combination of preselected basis functions to the dynamic programming costtogo function. We develop...

متن کامل

Approximate Counting by Dynamic Programming

This proposal describes a project that is going to investigate algorithms for counting knapsack solutions and related sets, with a focus on algorithms that utilise dynamic programming. Both the feasibility of the implementation and the performance characteristics of the algorithms are going to be examined; additional goals pertain to actual algorithmic improvements, with derandomisation being t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Automatica

سال: 2010

ISSN: 0005-1098

DOI: 10.1016/j.automatica.2010.02.006